Improving the Accuracy of History Based Branch Prediction
نویسندگان
چکیده
In this paper we present mechanisms that improve the accuracy and performance of history-based branch prediction. By studying the characteristics of the decision structures present in high-level languages, two mechanisms are proposed that reduce the number of wrong predictions made by a branch target buer (BTB). Execution-driven modeling is used to evaluate the improvement in branch prediction accuracy, as well as the reduction in overall program execution. stack, case block table.
منابع مشابه
Improving Indirect Branch Prediction With Source- and Arity-based Classification and Cascaded Prediction
Indirect branch prediction is likely to become more critical to program performance because indirect branches occur more frequently in object-oriented programs. We study indirect branch behavior in both procedural and object-oriented programs in order to build more accurate predictor architectures. First we use a statically classifying hybrid predictor with a shared history table and separate h...
متن کاملSpeculative Updates of Local and Global Branch History: A Quantitative Analysis
In today’s wide-issue processors, even small branch-misprediction rates introduce substantial performance penalties. Worse yet, inadequate branch prediction creates a bottleneck at the fetch stage, restricting other opportunities for improving performance. The choice of how to predict conditional-branch outcomes is the primary lever on prediction accuracy. But the choice of when to update the p...
متن کاملImproving the O-GEHL Branch Prediction Accuracy Using Analytical Results
The O-GEHL branch predictor has outperformed other prediction schemes using the same set of benchmarks in an international branch prediction contest, CBP-1. In this paper, we present the analysis results on each of the OGEHL branch predictor tables and also on the optimal number of predictor tables. Two methods are subsequently proposed to help increase the O-GEHL prediction accuracy. The first...
متن کاملDynamic per-branch history length adjustment to improve branch prediction accuracy
Branch misprediction limits processor performance signiWcantly, as the pipeline deepens and the instruction issued per cycle increases. Since the introduction of the two-level adaptive branch predictor, branch history has been a major input vector in branch prediction, together with the address of a branch instruction. Until now, the length of branch history has been statically Wxed for all bra...
متن کاملImproving Value Prediction Accuracy with Global Correlation
Value prediction is a technique to break true data dependencies by predicting the values that flows between producer and consumer instructions. Current approaches learn and reproduce the local history of instructions. Because values are complex functions of control and data flow, prediction can be improved by viewing values globally. The correlation of global branch history and global value his...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 46 شماره
صفحات -
تاریخ انتشار 1997